Stability of Ε-approximate Solutions to Convex Stochastic Programs∗

نویسنده

  • W. RÖMISCH
چکیده

An analysis of convex stochastic programs is provided when the underlying probability distribution is subjected to (small) perturbations. It is shown, in particular, that ε-approximate solution sets of convex stochastic programs behave Lipschitz continuously with respect to certain distances of probability distributions that are generated by the relevant integrands. It is shown that these results apply to linear two-stage stochastic programs with random recourse. We discuss the consequences on associating Fortet–Mourier metrics to two-stage models and on the asymptotic behavior of empirical estimates of such models, respectively.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

AutoCAT: Automated Product-Form Solution of Stochastic Models

We propose algorithms to automatically generate exact and approximate product-form solutions for large Markov processes that cannot be solved by direct numerical methods. Focusing on models that can be described as cooperating Markov processes, which include queueing networks and stochastic Petri nets as special cases, it is shown that finding a global optimum for a non-convex quadratic program...

متن کامل

Approximate Convex Optimization by Online Game Playing

Lagrangian relaxation and approximate optimization algorithms have received much attention in the last two decades. Typically, the running time of these methods to obtain a ε approximate solution is proportional to 1 ε 2 . Recently, Bienstock and Iyengar, following Nesterov, gave an algorithm for fractional packing linear programs which runs in 1 ε iterations. The latter algorithm requires to s...

متن کامل

Natasha 2: Faster Non-Convex Optimization Than SGD

We design a stochastic algorithm to train any smooth neural network to ε-approximate local minima, using O(ε−3.25) backpropagations. The best result was essentially O(ε−4) by SGD. More broadly, it finds ε-approximate local minima of any smooth nonconvex function in rate O(ε−3.25), with only oracle access to stochastic gradients. ∗V1 appeared on arXiv on this date. V2 and V3 polished writing. Th...

متن کامل

Convex Stochastic Duality and the ÔBiting LemmaÔ

The paper analyzes dynamic problems of stochastic optimization in discrete time. The problems under consideration are concerned with maximizing concave functionals on convex sets of feasible strategies (programs). Feasibility is defined in terms of linear inequality constraints in L∞ holding almost surely. The focus of the work is the existence of dual variables – stochastic Lagrange multiplier...

متن کامل

Nearly Linear-Time Packing and Covering LP Solvers

Packing and covering linear programs (LP) are an important class of problems that bridges computer science, operation research, and optimization. Efficient algorithms for solving such LPs have received significant attention in the past 20 years [LN93, PST95, BBR97, You01, Nem04, BI04, BBR04, Nes05, AK08, AHK12, KY13, You14, AO15]. Unfortunately, all known nearly-linear time algorithms for produ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007